On the max-weight edge coloring problem
نویسندگان
چکیده
We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one of weight equal to the maximum weight of its edges, so that the total weight of the partition is minimized. We explore the frontier between polynomial and NP-hard variants of the problem as well as the approximability of the NP-hard variants.
منابع مشابه
On the Complexity of the Max-Edge-Coloring Problem with Its Variant
The max-edge-coloring problem (MECP) is finding an edge colorings {E1, E2, E3, ..., Ez} of a weighted graph G=(V, E) to minimize { } ∑ = ∈ z i i k k E e e w 1 ) ( max , where w(ek) is the weight of ek. In the work, we discuss the complexity issues on the new graph problem and its variants. Specifically, we design a 2-approximmation algorithm for the max-edge-coloring problem on biplanar graphs....
متن کاملOn the Complexity of the Max-Edge-Coloring Problem with Its Variants
The max-edge-coloring problem (MECP) is finding an edge colorings {E1, E2, E3, ..., Ez} of a weighted graph G=(V, E) to minimize { } ∑ = ∈ z i i k k E e e w 1 ) ( max , where w(ek) is the weight of ek. In the work, we discuss the complexity issues on the MECP and its variants. Specifically, we design a 2-approximmation algorithm for the max-edge-coloring problem on biplanar graphs, which is bip...
متن کاملMax Edge Coloring of Trees
We study the weighted generalization of the edge coloring problem where the weight of each color class (matching) equals to the weight of its heaviest edge and the goal is to minimize the sum of the colors’ weights. We present a 3/2-approximation algorithm for trees.
متن کاملBounded Max-colorings of Graphs
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most b and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for such a coloring minimizing the sum of all color classes’ weights. In this paper we present complexity results and approximation algorithms for those problems on g...
متن کاملApproximating the Max Edge-Coloring Problem
The max edge-coloring problem is a natural weighted generalization of the classical edge-coloring problem arising in the domain of communication systems. In this problem each color class is assigned the weight of the heaviest edge in this class and the objective is to find a proper edge-coloring of the input graph minimizing the sum of all color classes’ weights. We present new approximation re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 20 شماره
صفحات -
تاریخ انتشار 2010